Cdmtcs Research Report Series Randomness Spaces Randomness Spaces
نویسندگان
چکیده
Martin-Lof de ned in nite random sequences over a nite alphabet via randomness tests which describe sets having measure zero in a constructive sense. In this paper this concept is generalized to separable topological spaces with a measure, following a suggestion of Zvonkin and Levin. After studying basic results and constructions for such randomness spaces a general invariance result is proved which gives conditions under which a function between randomness spaces preserves randomness. This corrects and extends a result by Schnorr. Calude and J urgensen proved that the randomness notion for real numbers obtained by considering their b-ary representations is independent from the base b. We use our invariance result to show that this notion is identical with the notion which one obtains by viewing the real number space directly as a randomness space. Furthermore, arithmetic properties of random real numbers are derived, for example that every computable analytic function preserves randomness. Finally, by considering the power set of the natural numbers with its natural topology as a randomness space, we introduce a new notion of a random set of numbers. It is di erent from the usual one which is de ned via randomness of the characteristic function, but it can also be characterized in terms of random sequences. Surprisingly, it turns out that there are in nite co-r.e. random sets.
منابع مشابه
CDMTCS Research Report Series Higher Randomness Notions and Their Lowness Properties
We study randomness notions given by higher recursion theory, establishing the relationships Π1-randomness ⊂ Π1-Martin-Löf randomness ⊂ ∆1randomness = ∆1-Martin-Löf randomness. We characterize the set of reals that are low for ∆1 randomness as precisely those that are ∆1 -traceable. We prove that there is a perfect set of such reals.
متن کاملCDMTCS Research Report Series Another Example of Higher Order Randomness
We consider the notion of randomness relative to an oracle: a real number is random in A if and only if its initial segments are algorithmically incompressible in a self-delimiting universal machine equipped with an oracle A. We prove that the probability that a program for infinite computations outputs a cofinite set is random in the second jump of the halting problem.
متن کاملCdmtcs Research Report Series on Hypersimple Sets and Chaitin Complexity on Hypersimple Sets and Chaitin Complexity
In this paper we study some computability theoretic properties of two notions of randomness for nite strings: randomness based on the blank-endmarker complexity measure and Chaitin randomness based on the self-delimiting complexity measure. For example, we nd the position of RAND and RAND at the same level in the scale of immunity notions by proving that both of them are not hyperimmune sets. A...
متن کاملMartin-LöF Randomness in Spaces of Closed Sets
Algorithmic randomness was originally defined for Cantor space with the fair-coin measure. Recent work has examined algorithmic randomness in new contexts, in particular closed subsets of 2ω ([2] and [8]). In this paper we use the probability theory of closed set-valued random variables (RACS) to extend the definition of Martin-Löf randomness to spaces of closed subsets of locally compact, Haus...
متن کاملComputability of probability measures and Martin-Lof randomness over metric spaces
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show th...
متن کامل